On the Complexity of Probabilistic Key Predistribution Schemes
نویسنده
چکیده
Collusion susceptible key predistribution schemes (KPS) are trade-offs between complexity and security. Measures of complexity include storage, computation and bandwidth overhead; a measure of security is their collusion resistance. Probabilistic KPSs (P-KPS) have some unique advantages in application scenarios where hardware assisted protection of secrets is mandatory. To facilitate a quantitative comparison of different facets of complexity associated with KPSs we investigate two generic device models suitable for a wide range of application scenarios where hardware assisted protection of secrets is mandatory. We propose a novel P-KPS, the subset keys and identity tickets (SKIT) scheme, which demands substantially lower overheads compared to other P-KPSs for such application scenarios.
منابع مشابه
A new key predistribution scheme for general and grid-group deployment of wireless sensor networks
Key predistribution for wireless sensor networks has been a challenging field of research because stringent resource constraints make the key predistribution schemes difficult to implement. Despite this, key predistribution scheme is regarded as the best option for key management in wireless sensor networks. Here, the authors have proposed a new key predistribution scheme. This scheme exhibits ...
متن کاملLPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملRandom Key Pre-Distribution Techniques against Sybil Attacks
Sybil attacks pose a serious threat for Wireless Sensor Networks (WSN) security. They can create problems in routing, voting schemes, decision making, distributed storage and sensor re-programming. In a Sybil attack, the attacker masquerades as multiple sensor identities that are actually controlled by one or a few existing attacker nodes. Sybil identities are fabricated out of stolen keys, obt...
متن کاملGraph-theoretic design and analysis of key predistribution schemes
Key predistribution schemes for resource-constrained networks are methods for allocating symmetric keys to devices in such a way as to provide an efficient trade-off between key storage, connectivity and resilience. While there have been many suggested constructions for key predistribution schemes, a general understanding of the design principles on which to base such constructions is somewhat ...
متن کاملStrongly Resilient Non-Interactive Key Predistribution For Hierarchical Networks
Key establishment is the basic necessary tool in the network security, by which pairs in the network can establish shared keys for protecting their pairwise communications. There have been some key agreement or predistribution schemes with the property that the key can be established without the interaction ([3], [4], [19]). Recently the hierarchical cryptography and the key management for hier...
متن کامل